SPECTRAL MATCHING THROUGH DATA COMPRESSION

Structures of String Matching and Data Compression

This doctoral dissertation presents a range of results concerning efficient algorithms and data structures for string processing, including several schemes contributing to sequential data compression. It comprises both theoretic results and practical implementations. We study the suffix tree data structure, presenting an efficient representation and several generalizations. This includes augmen...

Statistical Inference Through Data Compression

Effect of Data Compression on Pattern Matching in Historical Data

It is a common practice in the process industry to compress process data before it is archived. However, compression may alter the original data in a manner that makes extracting useful information from it more difficult. In this paper, popular data compression methods and their effect on pattern matching in historical data are evaluated. Pattern matching is performed using principal-component ...

Data Compression Issues with Pattern Matching in Historical Data

It is a common practice in the process industries to compress plant data before it is archived. However, compression may alter the data in a manner that makes it difficult to extract useful information from it. In this paper we evaluate the effectiveness of a new pattern matching technique1 for applications involving compressed historical data. We also compare several data compression methods w...

Vertex Data Compression through Vector Quantization

Rendering geometrically detailed 3D models requires the transfer and processing of large amounts of triangle and vertex geometry data. Compressing the geometry bitstream can reduce bandwidth requirements and alleviate transmission bottlenecks. In this paper, we show vector quantization to be an effective compression technique for triangle mesh vertex data. We present predictive vector quantizat...